Classification Using Φ-Machines and Constructive Function Approximation
نویسندگان
چکیده
منابع مشابه
Kernel machines and additive fuzzy systems: classification and function approximation
This paper investigates the connection between additive fuzzy systems and kernel machines. We prove that, under quite general conditions, these two seemingly quite distinct models are essentially equivalent. As a result, algorithms based upon Support Vector (SV) learning are proposed to build fuzzy systems for classification and function approximation. The performance of the proposed algorithm ...
متن کاملConstructive Function Approximation: Theory and Practice
In this paper we study the theoretical limits of finite constructive convex approximations of a given function in a Hilbert space using elements taken from a reduced subset. We also investigate the trade-off between the global error and the partial error during the iterations of the solution. These results are then specialized to constructive function approximation using sigmoidal neural networ...
متن کاملMultilevel Data Classification and Function Approximation Using Hierarchical Neural Networks
Combining diverse features and multiple classifiers is an open research area in which no optimal strategy is found but successful experimental studies have been performed depending on a specific task at hand. In this chapter, a strategy for combining diverse features and multiple classifiers is presented as an exemplary new model in multilevel data classification using hierarchical neural netwo...
متن کاملConstructive Neural Network Algorithms for Function Approximation Tasks
The generalization capability and training time of conventional neural networks depend on their architecture. In conventional neural networks, we have to define the architecture prior to training but in constructive neural network (CoNN) algorithms the network architecture is constructed during the training process. This paper presents an overview of CoNN algorithms that constructing feedforwar...
متن کاملfragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2004
ISSN: 0885-6125
DOI: 10.1023/b:mach.0000019803.57720.7b